Preprint , arXiv : 0909 . 3808 VARIOUS CONGRUENCES INVOLVING BINOMIAL COEFFICIENTS AND HIGHER - ORDER CATALAN NUMBERS

نویسندگان

  • Zhi-Wei Sun
  • ZHI-WEI SUN
  • H. Pan
چکیده

Let p be a prime and let a be a positive integer. In this paper we investigate P p a −1 k=0`(h+1)k k+d´/m k modulo a prime p, where d and m are integers with −h < d p a and m ≡ 0 (mod p). We also study congruences involving higher-order Catalan numbers C (h) k = 1 hk+1`(h+1)k k ´ and ¯ C (h) k = h k+1`(h+1)k k ´. Our tools include linear recurrences and the theory of cubic residues. Here are some typical results in the paper. (i) If p a ≡ 1 (mod 6) then p a −1

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Jacobi Polynomials and Congruences Involving Some Higher-Order Catalan Numbers and Binomial Coefficients

In this paper, we study congruences on sums of products of binomial coefficients that can be proved by using properties of the Jacobi polynomials. We give special attention to polynomial congruences containing Catalan numbers, second-order Catalan numbers, the sequence Sn = ( 3n)( 3n 2n) 2( n )(2n+1) , and the binomial coefficients ( 3n n )

متن کامل

Multiple analogues of binomial coefficients and families of related special numbers

Multiple qt-binomial coefficients and multiple analogues of several celebrated families of related special numbers are constructed in this paper. These higher dimensional generalizations include the first and the second kind of qt-Stirling numbers, qt-Bell numbers, qt-Bernoulli numbers, qt-Catalan numbers and the qt-Fibonacci numbers. Certain significant applications are also studied including ...

متن کامل

Certain General Binomial-fibonacci Sums

Numerous writers appear to have been fascinated by the many interesting summation identitites involving the Fibonacci and related Lucas numbers. Various types of formulas are discussed and various methods are used. Some involve binomial coefficients [2 ] , [4 ] . Generating function methods are used in [2] and [5] and higher powers appear in [6] . Combinations of these or other approaches appea...

متن کامل

A Method for Determining the Mod-2k Behaviour of Recursive Sequences, with Applications to Subgroup Counting

We present a method to obtain congruences modulo powers of 2 for sequences given by recurrences of finite depth with polynomial coefficients. We apply this method to Catalan numbers, Fuß–Catalan numbers, and to subgroup counting functions associated with Hecke groups and their lifts. This leads to numerous new results, including many extensions of known results to higher powers of 2. ∗Research ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009